High order approximation to non-smooth multivariate functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High order approximation to non-smooth multivariate functions

Approximations of non-smooth multivariate functions return low-order approximations in the vicinities of the singularities. Most prior works solve this problem for univariate functions. In this work we introduce a method for approximating non-smooth multivariate functions of the form f = g + r+ where g, r ∈ C(R) and the function r+ is defined by r+(y) = { r(y), r(y) ≥ 0 0, r(y) < 0 , ∀y ∈ R . G...

متن کامل

Optimal Order of Convergence and (In-) Tractability of Multivariate Approximation of Smooth Functions

We study the approximation problem for C∞ functions f : [0, 1] → R with respect to a Wm p -norm. The optimal order of convergence is infinite, hence excellent, but the problem is still intractable for m ≥ 1. This means that the order of convergence supplies incomplete information concerning the computational difficulty of a problem. For m = 0 and p = 2, we prove that the problem is not polynomi...

متن کامل

Approximation of Multivariate Functions

We discuss one approach to the problem of approximating functions of many variables which is truly multivariate in character. This approach is based on superpositions of functions with infinite families of smooth simple functions. §

متن کامل

Approximation of Multivariate Functions

| In this paper, a new class of higher-order feedforward neural networks, called ridge polynomial networks (RPN) is formulated. The new networks are shown to uniformly approximate any continuous function on a compact set in multidimensional input space with any degree of accuracy. Moreover, these networks have an eecient and regular architecture as compared to ordinary higher-order feedforward ...

متن کامل

Multivariate Refinable Functions of High Approximation Order Via Quotient Ideals of Laurent Polynomials

We give an algebraic interpretation of the well–known “zero–condition” or “sum rule” for multivariate refinable functions with respect to an arbitrary scaling matrix. The main result is a characterization of these properties in terms of containment in a quotient ideal, however not in the ring of polynomials but in the ring of Laurent polynomials.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Aided Geometric Design

سال: 2018

ISSN: 0167-8396

DOI: 10.1016/j.cagd.2018.02.004